Tutte polynomial

Results: 101



#Item
31On the hardness of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA

On the hardness of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA

Add to Reading List

Source URL: ccom.uprrp.edu

Language: English - Date: 2011-03-02 23:57:00
32Finding Branch-decompositions and Rank-decompositions Petr Hlinˇen´y ∗† Faculty of Informatics Masaryk University Botanick´a 68a, Brno, Czech Rep.

Finding Branch-decompositions and Rank-decompositions Petr Hlinˇen´y ∗† Faculty of Informatics Masaryk University Botanick´a 68a, Brno, Czech Rep.

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2008-02-12 04:44:10
33Journal of Machine Learning Research vol–23  Submitted 24 May 2012; Published 2012 Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model

Journal of Machine Learning Research vol–23 Submitted 24 May 2012; Published 2012 Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2012-06-05 15:17:28
34

PDF Document

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2013-01-31 16:35:17
35Degree distribution in random planar graphs Michael Drmota∗ Omer Gim´enez†  Marc Noy‡

Degree distribution in random planar graphs Michael Drmota∗ Omer Gim´enez† Marc Noy‡

Add to Reading List

Source URL: www.dmg.tuwien.ac.at

Language: English - Date: 2008-09-20 01:50:49
36C:/Users/user/Documents/Paper/Planar Graphs/Max Degree/Journal AiM/MaxDegreePlanar.dvi

C:/Users/user/Documents/Paper/Planar Graphs/Max Degree/Journal AiM/MaxDegreePlanar.dvi

Add to Reading List

Source URL: www.dmg.tuwien.ac.at

Language: English - Date: 2012-03-30 08:52:31
37Edge-Selection Heuristics for Computing Tutte Polynomials David J. Pearce Computer Science Group, Victoria University of Wellington, New Zealand

Edge-Selection Heuristics for Computing Tutte Polynomials David J. Pearce Computer Science Group, Victoria University of Wellington, New Zealand

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-03 17:30:57
38Edge-Selection Heuristics for Computing Tutte Polynomials

Edge-Selection Heuristics for Computing Tutte Polynomials

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-02 16:13:27
39Zeros of the Jones polynomial Xiao-Song Lin Department of Mathematics University of California, Riverside  Thanks for collaboration and consultation are due to:

Zeros of the Jones polynomial Xiao-Song Lin Department of Mathematics University of California, Riverside Thanks for collaboration and consultation are due to:

Add to Reading List

Source URL: math.ucr.edu

Language: English - Date: 2007-02-27 18:10:44
40Approximating the average stretch factor of geometric graphs∗ Siu-Wing Cheng† Christian Knauer‡ Stefan Langerman§ Michiel Smid¶ Abstract Let G be a geometric graph whose vertex set S is a set of n points in Rd .

Approximating the average stretch factor of geometric graphs∗ Siu-Wing Cheng† Christian Knauer‡ Stefan Langerman§ Michiel Smid¶ Abstract Let G be a geometric graph whose vertex set S is a set of n points in Rd .

Add to Reading List

Source URL: www.cs.ust.hk

Language: English - Date: 2011-01-03 00:53:54